Approximation algorithms for scheduling trees with general communication delays
نویسنده
چکیده
1 Introduction
منابع مشابه
A Simple Approximation Algorithm for Scheduling Forests with Unit Processing Times and Zero-One Communication Delays
In the last few years, scheduling jobs due to communication delays has received a great deal of attention. We consider the problem of scheduling forests due to unit processing times and zero-one communication delays and focus on the approximation algorithm of Hanen and Munier and on the algorithm of Guinand, Rapine and Trystram. These algorithms and their analysis are quite complex. In contrast...
متن کاملScheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation
In the last few years, multi-processor scheduling with interprocessor communication delays has received increasing attention. This is due to the more realistic constraints in modeling parallel processor systems. Most research in this vein is concerned with the makespan criterion. We contribute to this work by presenting a new and simple ( 2 1)-approximation algorithm for scheduling to minimize ...
متن کاملScheduling Trees with Communication Delays
Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP-complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown that the problem remains NP-complete for binary trees with uniform communication delays. The same hold...
متن کاملScheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract)
In the last few years, multi-processor scheduling with interprocessor communication delays has received increasing attention. This is due to the more realistic constraints in modeling parallel processor systems. Most research in this vein is concerned with the makespan criterion. We contribute to this work by presenting a new and simple (2 1 m )-approximation algorithm for scheduling to minimiz...
متن کاملSensitivity analysis of tree scheduling on two machines with communication delays
This paper presents a sensitivity analysis for the problem of scheduling UET trees with communication delays on two identical processors, to minimize the makepan. Indeed, actual communication delays may not be precisely known before the execution. The paper compares the optimal makespans with and without communication delays. This is used to get sensitivity bounds for algorithms optimal in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 25 شماره
صفحات -
تاریخ انتشار 1999